Umacs: A Universal Markov Chain Sampler
نویسنده
چکیده
Umacs (Universal Markov chain sampler) is an R software package that facilitates the construction of the Gibbs sampler and Metropolis algorithm for Bayesian inference. Umacs is a practical tool to write samplers in R. This is sometimes necessary for large problems that cannot be fit using programs like BUGS. The user supplies the data, parameter names, updating functions, and a procedure for generating starting points. The updating functions can be some mix of Gibbs samplers and Metropolis jumps, with the latter determined by specifying a log-posterior density function. Using these inputs, Umacs writes a customized R function that automatically updates, keeps track of Metropolis acceptances (and uses acceptance probabilities to tune the jumping kernels), monitors convergence, returns a summary of the results that can be coerced into random variable objects for further processing in R. Umacs is extendable so that users can also write their own updater-generating classes which may be used in this framework along with the existing Gibbs and Metropolis samplergenerating classes.
منابع مشابه
Applied Bayesian Inference in R using MCMCpack
Sampling) project is a long-running project to provide a user-friendly language and environment for Bayesian inference. The first article, by Andrew Thomas and colleagues, describes the BRugs package which provides an R interface to the OpenBUGS engine. The second article by Andrew Thomas describes the BUGS language itself and the design philosophy behind it. Somewhat unusually for an article i...
متن کاملPreaching to the unconverted.
Springer, New York, New York, USA. Hilborn, R., and M. Mangel. 1997. The ecological detective: confronting models with data. Princeton University Press, Princeton, New Jersey, USA. Hurlbert, S. 1984. Pseudoreplication and the design of ecological field experiments. Ecological Monographs 54: 187–211. Ionides, E. L., C. Bretó, and A. A. King. 2006. Inference for nonlinear dynamical systems. Proce...
متن کاملThe Fuss Algorithm: a Fast Universal Self-tuned Sampler within Gibbs
Gibbs sampling is a well-known Markov Chain Monte Carlo (MCMC) technique, widely applied to draw samples from multivariate target distributions which appear often in many different fields (machine learning, finance, signal processing, etc.). The application of the Gibbs sampler requires being able to draw efficiently from the univariate full-conditional distributions. In this work, we present a...
متن کاملA fast universal self-tuned sampler within Gibbs sampling
Bayesian inference often requires efficient numerical approximation algorithms, such as sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) methods. The Gibbs sampler is a well-known MCMC technique, widely applied in many signal processing problems. Drawing samples from univariate full-conditional distributions efficiently is essential for the practical application of the Gibbs sam...
متن کاملOn the use of auxiliary variables in Markov chain Monte Carlo sampling
We study the slice sampler, a method of constructing a reversible Markov chain with a speciied invariant distribution. Given an independence Metropolis-Hastings algorithm it is always possible to construct a slice sampler that dominates it in the Peskun sense. This means that the resulting Markov chain produces estimates with a smaller asymptotic variance. Furthermore the slice sampler has a sm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006